A CCA2-Secure Multi-Decrypter Encryption Scheme Without Random Oracles
نویسندگان
چکیده
Shengbao WANG, Peng ZENG, Kim-Kwang Raymond CHOO, Hongbing WANG 1School of Information Science and Engineering, Hangzhou Normal University Hangzhou 310012, PR China 2Shanghai Key Laboratory of Trustworthy Computing, East China Normal University Shanghai 200062, PR China 3Information Assurance Research Group, Advanced Computing Research Centre University of South Australia, Adelaide SA 5000, Australia 4Department of Computer Science and Engineering, Shanghai Jiao Tong University Shanghai 200240, PR China e-mail: [email protected], [email protected], [email protected], [email protected]
منابع مشابه
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding open problem of “circular encryption,” by presenting a public key encryption scheme and proving that it is semantically secure against key dependent chosen plaintext attack (KDMCPA security) under standard assumptions (and without resorting to random oracles). However, they left as an open problem tha...
متن کاملHow to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes
Suppose that we wish to encrypt long messages with small overhead by a public key encryption scheme which is secure against adaptive chosen ciphertext attack (IND-CCA2). Then the previous schemes require either a large size one-way trapdoor permutation (OAEP) or both a large size symmetric encryption scheme and a small size asymmetric encryption scheme (hybrid encryption). In this paper, we sho...
متن کاملEfficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model in groups equipped with a bilinear map. Selective identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in the sta...
متن کاملPlaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to the notion of plaintext awareness (denoted PA) [2], but it is, “properly”, a weaker security class for public-key encryption. It is known that PA implies the class of CCA2-secure encryption (denoted IND-CCA2) but not ...
متن کاملEfficient Identity-Based Encryption Without Random Oracles
We present the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. We first present our IBE construction and reduce the security of our scheme to the decisional Bilinear Diffie-Hellman (BDH) problem. Additionally, we show that our techniques can be used to build a new signature scheme that is secure under the computational Diffie-Hellman assumptio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Informatica, Lith. Acad. Sci.
دوره 26 شماره
صفحات -
تاریخ انتشار 2015